Generalized Guaranteed Rate Scheduling Algorithms: A Framework - Networking, IEEE/ACM Transactions on
نویسندگان
چکیده
In this paper, we define a class of generalized Guaranteed Rate (GR) scheduling algorithms that includes algorithms which allocate variable rate to packets of a flow. We define work-conserving generalized Virtual Clock, Packet-byPacket Generalized Processor Sharing, and Self-Clocked Fair Queuing scheduling algorithms that can allocate variable rate to the packets of a flow. We also define scheduling algorithms suitable for servers where packet fragmentation may occur. We demonstrate that if a class of rate controllers is employed for a flow in conjunction with any scheduling algorithm in GR, then the resulting non-work-conserving algorithm also belongs to GR. This leads to the definition of several non-work-conserving algorithms. We then present a method for deriving the delay guarantee of a network of servers when: 1) different rates are allocated to packets of a flow at different servers along the path and the bottleneck server for each packet may be different, and 2) packet fragmentation and/or reassembly may occur. This delay guarantee enables a network to provide various service guarantees to flows conforming to any specification. We illustrate this by utilizing delay guarantee to derive delay bounds for flows conforming to Leaky Bucket, Exponentially Bounded Burstiness, and Flow Specification. Our method for determining these bounds is valid in internetworks and leads to tighter results.
منابع مشابه
Static-priority scheduling of multiframe tasks
The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of Liu and Layland (Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), pp. 46{61. 1973 ). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studi...
متن کاملLatency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms - Networking, IEEE/ACM Transactions on
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an LR server is determined by two parameters—the latency and the allocated rate. Several well-known scheduling algorithms, such as Weighted Fair Queueing, VirtualClock, SelfClocked Fair Queueing, Weighted Round Robin...
متن کاملIEEE/ACM TRANSACTIONS ON NETWORKING. VOL. 3, NO, 4. AUGUST 1995 423 Optimal Flow Control Schemes that
متن کامل
An optimal GTS scheduling algorithm for time-sensitive transactions in IEEE 802.15.4 networks
IEEE 802.15.4 is a new enabling standard for low-rate wireless personal area networks and has been widely accepted as a de facto standard for wireless sensor networking. While primary motivations behind 802.15.4 are low power and low cost wireless communications, the standard also supports time and rate sensitive applications because of its ability to operate in TDMA access modes. The TDMA mode...
متن کاملDelay bounds for a network of guaranteed rate servers with FIFO aggregation
To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large number of results available for flow-based scheduling algorithms, few such results are available for aggregate-based scheduling. In this paper, we study a network implementing Guaranteed Rate (GR) scheduling with First...
متن کامل